
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 1540. -- [POI2005]Dzi-Hollows
</title><center><h2>1540: [POI2005]Dzi-Hollows
</h2><span class=green>Time Limit: </span>10 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>162 MB<br><span class=green>Submit: </span>115&nbsp;&nbsp;<span class=green>Solved: </span>27<br>[<a href='submitpage.php?id=1540'>Submit</a>][<a href='problemstatus.php?id=1540'>Status</a>][<a href='bbs.php?id=1540'>Discuss</a>]</center><h2>Description</h2><div class=content>在 Byteotia境内有两棵非常高的树, 树上有一些洞. 一天n 只鸟飞来这里要住进这些树洞里. 他们中的有一些是好朋友想互相能访问到对方的树洞,所以他们必须遵守: 
·	任意两只想互相访问的鸟必须住在不同·	的树上; 
·	对于任意两对鸟如果他们访问的路线不·	能相交(访问的路线看做是树洞间的直线),但是共顶点是允许的. 
另外有一点,每只鸟都想尽量住低一点,所以任何一棵书上都只会住连续的x只鸟而不会出现中间出现空树洞的情况. 
我们想知道一共有多少种住宿安排使得条件满足. 
</div><h2>Input</h2><div class=content>第一行三个整数n, m 和 k, 分别表示: 鸟的个数, 互相访问的鸟的对数以及输出时用到的数, 2 <= n <= 1 000 000, 1 <= m <= 10 000 000, 2 <= k <= 2 000 000. 鸟儿从1 到 n编号. 接下来m 行每行两个数ai 和 bi, 表示相连的两只鸟(1 <= ai, bi <= n,  ai <> bi). 特定的一对鸟在文件中最多出现一次. 
</div><h2>Output</h2><div class=content>输出总方案mod p后的数字. 

</div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>3 2 10<br />
1 2<br />
1 3<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>4<br />
</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search='></a></p></div><center>[<a href='submitpage.php?id=1540'>Submit</a>][<a href='problemstatus.php?id=1540'>Status</a>][<a href='bbs.php?id=1540'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
